Ironic Complicity: Satisfiability Algorithms and Circuit Lower Bounds
نویسنده
چکیده
I discuss recent progress in developing and exploiting connections between SAT algorithms and circuit lower bounds. The centrepiece of the article is Williams’ proof that NEXP 6⊆ ACC, which proceeds via a new algorithm for ACC-SAT beating brute-force search. His result exploits a formal connection from non-trivial SAT algorithms to circuit lower bounds. I also discuss various connections in the reverse direction, which have led to improved algorithms for k-SAT, Formula-SAT and AC-SAT, among other
منابع مشابه
Connecting SAT Algorithms and Complexity Lower Bounds
I will describe prior and current work on connecting the art of finding good satisfiability algorithms with the art of proving complexity lower bounds: proofs of limitations on what problems can be solved by good algorithms. Surprisingly, even minor algorithmic progress on solving the circuit satisfiability problem faster than exhaustive search can be applied to prove strong circuit complexity ...
متن کاملSatisfiability Algorithms for Restricted Circuit Classes
In recent years, finding new satisfiability algorithms for various circuit classes has been a very active line of research. Despite considerable progress, we are still far away from a definite answer on which circuit classes allow fast satisfiability algorithms. This survey takes a (far from exhaustive) look at some recent satisfiability algorithms for a range of circuit classes and highlights ...
متن کاملBounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression
A Boolean function f : {0, 1} → {0, 1} is weighted symmetric if there exist a function g : Z → {0, 1} and integers w0, w1, . . . , wn such that f(x1, . . . , xn) = g(w0 + ∑n i=1 wixi) holds. In this paper, we present algorithms for the circuit satisfiability problem of bounded depth circuits with AND, OR, NOT gates and a limited number of weighted symmetric gates. Our algorithms run in time sup...
متن کاملAlgorithms versus Circuit Lower Bounds
Different techniques have been used to prove several transference theorems of the form “nontrivial algorithms for a circuit class C yield circuit lower bounds against C”. In this survey we revisit many of these results. We discuss how circuit lower bounds can be obtained from derandomization, compression, learning, and satisfiability algorithms. We also cover the connection between circuit lowe...
متن کاملT C C C
I discuss recent progress in developing and exploiting connections between SAT algorithms and circuit lower bounds. The centrepiece of the article is Williams’ proof that NEXP * ACC0, which proceeds via a new algorithm for ACC0-SAT beating brute-force search. His result exploits a formal connection from non-trivial SAT algorithms to circuit lower bounds. I also discuss various connections in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bulletin of the EATCS
دوره 106 شماره
صفحات -
تاریخ انتشار 2012